A New Graph Invariant for Graph Isomorphism: Probability Propagation Matrix
نویسندگان
چکیده
The graph isomorphism problem is to determine whether two given graphs are iso-morphic or not. In this paper, we present a new graph invariant, called the probability propagation matrix. By means of this graph invariant, we present a heuristic algorithm for the problem. The algorithm is easy to implement and highly parallelizable.
منابع مشابه
Fast Practical Algorithm Based on Weisfeiler-lehman Method for Graph Isomorphism
Graph isomorphism problem is to determine whether two given graphs are isomorphic. It is a particular type of a more general problem “the isomorphism of incidence system”. I propose some new invariants for heuristic search of graph isomorphism and demonstrate that they are really useful in practice by experiments. Keyword. graph isomorphism, graph invariant, graph spectrum , adjacency matrix, m...
متن کاملAn Approach of Graph Isomorphism Detection based on Vertex-Invariant
Graph Isomorphism is a widely studied problem due to its practical applications in various fields of networks, chemistry and finger print detection, recent problems in biology such as diabetes detection, protein structure and information retrieval. An approach to the graph isomorphism detection is based on vertex invariant. In the existing approach vertex invariants is used to partition the mat...
متن کاملGraph Matrix Completion in Presence of Outliers
Matrix completion problem has gathered a lot of attention in recent years. In the matrix completion problem, the goal is to recover a low-rank matrix from a subset of its entries. The graph matrix completion was introduced based on the fact that the relation between rows (or columns) of a matrix can be modeled as a graph structure. The graph matrix completion problem is formulated by adding the...
متن کاملSome New Results On the Hosoya Polynomial of Graph Operations
The Wiener index is a graph invariant that has found extensive application in chemistry. In addition to that a generating function, which was called the Wiener polynomial, who’s derivate is a q-analog of the Wiener index was defined. In an article, Sagan, Yeh and Zhang in [The Wiener Polynomial of a graph, Int. J. Quantun Chem., 60 (1996), 959969] attained what graph operations do to the Wiene...
متن کاملImproved random graph isomorphism
Canonical labeling of a graph consists of assigning a unique label to each vertex such that the labels are invariant under isomorphism. Such a labeling can be used to solve the graph isomorphism problem. We give a simple, linear time, high probability algorithm for the canonical labeling of a G(n, p) random graph for p ∈ [ ω ( ln n/n ln lnn ) , 1− ω ( ln n/n ln lnn )] . Our result covers a gap ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Inf. Sci. Eng.
دوره 15 شماره
صفحات -
تاریخ انتشار 1999